FREYA—A New Monte Carlo Code for Improved Modeling of Fission Chains
نویسندگان
چکیده
منابع مشابه
Monte Carlo without Chains
A sampling method for spin systems is presented. The spin lattice is written as the union of a nested sequence of sublattices, all but the last with conditionally independent spins, which are sampled in succession using their marginals. The marginals are computed concurrently by a fast algorithm; errors in the evaluation of the marginals are offset by weights. There are no Markov chains and eac...
متن کاملA New Approach for Monte Carlo Simulation of RAFT Polymerization
In this work, based on experimental observations and exact theoretical predictions, the kinetic scheme of RAFT polymerization is extended to a wider range of reactions such as irreversible intermediate radical terminations and reversible transfer reactions. The reactions which have been labeled as kinetic scheme are the more probable existing reactions as the theoretical point of view. The ...
متن کاملModeling and dose calculations of a pure beta emitting 32P coated stent for intracoronary brachytherapy by Monte Carlo code
Background: Recently, different investigators have studied the possibility of radiation therapy in restenosis prevention and have shown promising results. In this study a unique radioactive source for intra vascular brachytherapy (IVBT) was investigated. The two-dimensional dose distribution in water for a 32P IVBT stent has been calculated. The pure beta emitter source 32P has been co...
متن کاملOrdering Monte Carlo Markov Chains
Markov chains having the same stationary distribution can be partially ordered by performance in the central limit theorem. We say that one chain is at least as good as another in the e ciency partial ordering if the variance in the central limit theorem is at least as small for every L( ) functional of the chain. Peskun partial ordering implies e ciency partial ordering [25, 30]. Here we show ...
متن کاملImproved Monte-Carlo Search
Monte-Carlo search has been successful in many non-deterministic games, and recently in deterministic games with high branching factor. One of the drawbacks of the current approaches is that even if the iterative process would last for a very long time, the selected move does not necessarily converge to a game-theoretic optimal one. In this paper we introduce a new algorithm, UCT, which extends...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Nuclear Science
سال: 2013
ISSN: 0018-9499,1558-1578
DOI: 10.1109/tns.2013.2251425